Linear Visualization of a Directed Finite Graph with Labels on Edges
نویسنده
چکیده
Visualization has become an integral part in a wide array of application areas, and papers are solicited both for original visualization research and for the application of visualization towards the understanding of domain-specific data. Our main objective is the visual representation of a directed finite graph with labels attached to edges based on the structure properties of the graph. In particular, the transition graph of any deterministic finite automaton is also accepted. A representation problem of a visual image of a digraph has appeared in the study of the road coloring conjecture. A polynomial-time algorithm for the road coloring has been based on recent positive solution of this old famous problem. Our visualization program is used for demonstration of the algorithm as well as for visualization of the transition graph of any deterministic finite automaton (DFA). This help tool is linear in the size of the automaton.
منابع مشابه
The Visualization of the Road Coloring Algorithm in the package TESTAS
A problem of a visual image of a directed finite graph has appeared in the study of the road coloring conjecture. Given a finite directed graph, a coloring of its edges turns the graph into finite-state automaton. The visual perception of the structure properties of automata is an important goal. A synchronizing word of a deterministic automaton is a word in the alphabet of colors of its edges ...
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملLinear Visualization of a Road Coloring Algorithm
The visualization has become essential in many application areas. The finite graphs and automata undoubtedly belong to such areas. A problem of a visual image of a directed finite graph has appeared in the study of the road coloring conjecture. Given a finite directed graph, a coloring of its edges turns the graph into finitestate automaton. The visual perception of the structure properties of ...
متن کامل9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Cologne, Germany, May 25-27, 2010. Extended Abstracts
The visualization has become essential in many application areas. The finite graphs and automata undoubtedly belong to such areas. A problem of a visual image of a directed finite graph has appeared in the study of the road coloring conjecture. Given a finite directed graph, a coloring of its edges turns the graph into finitestate automaton. The visual perception of the structure properties of ...
متن کاملScalable Image Annotation by Summarizing Training Samples into Labeled Prototypes
By increasing the number of images, it is essential to provide fast search methods and intelligent filtering of images. To handle images in large datasets, some relevant tags are assigned to each image to for describing its content. Automatic Image Annotation (AIA) aims to automatically assign a group of keywords to an image based on visual content of the image. AIA frameworks have two main sta...
متن کامل